algorithm xの例文

• Knuth's Algorithm X is an algorithm that finds all solutions to an exact cover problem.
• The exact cover problem is represented in Algorithm X using a matrix " A " consisting of 0s and 1s.
• DLX is the name given to Algorithm X when it is implemented efficiently using Donald Knuth's Dancing Links technique on a computer.
• :: As an example, in the typical WP : NPOV style of Wikipedian prose, the reader does not need to be told explicitly that algorithm X is an " important advance "-instead, the reader simply needs to be told that this person worked on generalizing PageRank algorithms for use in networks.
• When Algorithm X is implemented efficiently using Donald Knuth's Dancing Links technique on a computer, Knuth calls it DLX . DLX uses the matrix representation of the problem, implemented as a series of doubly linked lists of the 1s of the matrix : each 1 element has a link to the next 1 above, below, to the left, and to the right of itself . ( Technically, because the lists are circular, this forms a torus ).